Uniform Lipschitz constants in Chebyshev polynomial approximation
نویسندگان
چکیده
منابع مشابه
Distributed Signal Processing via Chebyshev Polynomial Approximation
Unions of graph multiplier operators are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators. The proposed method features approximations of the graph multipliers by shifted Chebyshev polynomials, whose recurrence relations make them readily amenable to distributed computation. We...
متن کاملRigorous uniform approximation of D-finite functions using Chebyshev expansions
A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of such methods in the context of rigorous computing (where we need guarantees on the accuracy of the result), and from the complexity point of view. It is well-kn...
متن کاملContourlet Filter Design Based on Chebyshev Best Uniform Approximation
The contourlet transform can deal effectively with images which have directional information such as contour and texture. In contrast to wavelets for which there exists many good filters, the contourlet filter design for image processing applications is still an ongoing work. Therefore, this paper presents an approach for designing the contourlet filter based on the Chebyshev best uniform appro...
متن کاملReal Polynomial Chebyshev Approximation by the Carathiodory - Fejir Method
A new method is presented for near-best approximation of a real function F on [-r, r] by a polynomial of degree m. The method is derived by transplanting the given problem to the unit disk, then applying the Carath6odory-Fej6r theorem. The resulting near-best approximation is constructed from the principal eigenvalue and eigenvector of a Hankel matrix of Chebyshev coefficients of F. It is well ...
متن کاملChebyshev Polynomial Approximation to Approximate Partial Differential Equations
This pa per suggests a simple method based on Chebyshev approximation at Chebyshev nodes to approximate partial differential equations. The methodology simply consists in determining the value function by using a set of nodes and basis functions. We provide two examples. Pricing an European option and determining the best policy for chatting down a machinery. The suggested method is flexible, e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1990
ISSN: 0021-9045
DOI: 10.1016/0021-9045(90)90044-q